منابع مشابه
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients
In this paper we will show that it is possible to generate the roots of monic polynomials with computable real coe)cients as computable complex numbers. A result from constructive analysis has already shown that the roots are computable numbers; however, because the proof is non-constructive it does not provide an e1ective method for $nding the roots. In this work we combine two extra stages to...
متن کاملPolynomials with Nonnegative Coefficients
The authors verify the conjecture that a conjugate pair of zeros can be factored from a polynomial with nonnegative coefficients so that the resulting polynomial still has nonnegative coefficients. The conjecture was originally posed by A. Rigler, S. Trimble, and R. Varga arising out of their work on the Beauzamy-Enflo generalization of Jensen's inequality. The conjecture was also made independ...
متن کاملFactoring Polynomials with Rational Coefficients
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial f e Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest comm...
متن کاملChebyshev Polynomials with Integer Coefficients
We study the asymptotic structure of polynomials with integer coef cients and smallest uniform norms on an interval of the real line Introducing methods of the weighted potential theory into this problem we improve the bounds for the multiplicities of some factors of the integer Chebyshev polynomials Introduction Let Pn C and Pn Z be the sets of algebraic polynomials of degree at most n respect...
متن کاملSmall Polynomials with Integer Coefficients
The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1970
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093894074